Kernel Characterization of an Interval Function
نویسندگان
چکیده
This paper proposes a set-membership approach to characterize the kernel of an intervalvalued function. In the context of a bounded-error estimation, this formulation makes it possible to embed all uncertainties of the problem inside the interval function and thus to avoid bisections with respect to all these uncertainties. To illustrate the principle of the approach, two testcases taken from robotics will be presented. The first testcase deals with the characterization of all loops of a mobile robot from proprioceptive measurements only. The second testcase is the localization of a robot from range-only measurements.
منابع مشابه
Interval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets
This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملA Berry-Esseen Type Bound for a Smoothed Version of Grenander Estimator
In various statistical model, such as density estimation and estimation of regression curves or hazard rates, monotonicity constraints can arise naturally. A frequently encountered problem in nonparametric statistics is to estimate a monotone density function f on a compact interval. A known estimator for density function of f under the restriction that f is decreasing, is Grenander estimator, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics in Computer Science
دوره 8 شماره
صفحات -
تاریخ انتشار 2014